Generalized ρ-Almost Periodic Sequences and Applications
نویسندگان
چکیده
In this paper, we analyze the Bohr ρ-almost periodic type sequences and generalized of form F:I×X→Y, where ∅≠I⊆Zn, X Y are complex Banach spaces ρ is a general binary relation on Y. We provide many structural results, observations open problems about introduced classes sequences. Certain applications established theoretical results to abstract Volterra integro-difference equations also given.
منابع مشابه
Rotation Sets and Almost Periodic Sequences
We study the rotational behaviour on minimal sets of torus homeomorphisms and show that the associated rotation sets can be any type of line segments as well as non-convex and even plane-separating continua. This shows that restrictions which hold for rotation set on the whole torus are not valid on minimal sets. The proof uses a construction of rotational horseshoes by Kwapisz to transfer the ...
متن کاملOn Periodic ∞-generalized Fibonacci Sequences
The notion of an∞-generalized Fibonacci sequence has been introduced in [6], and studied in [1], [7], [9]. This class of sequences defined by linear recurrences of infinite order is an extension of the class of ordinary (weighted) r-generalized Fibonacci sequences (r-GFS, for short) with r finite defined by linear recurrences of r order (for example, see [2], [3], [4], [5], [8] etc.) More preci...
متن کاملOn Almost Increasing Sequences and Its Applications
We prove a general theorem on |N̄,pn;δ|k summability factors, which generalizes a theorem of Bor (1994) on |N̄,pn|k summability factors, under weaker conditions by using an almost increasing sequence. 2000 Mathematics Subject Classification. Primary 40D15, 40F05, 40G99.
متن کاملGeneralized Fourier-Bessel operator and almost-periodic interpolation and approximation
We consider functions f of two real variables, given as trigonometric functions over a finite set F of frequencies. This set is assumed to be closed under rotations in the frequency plane of angle 2kπ M for some integer M . Firstly, we address the problem of evaluating these functions over a similar finite set E in the space plane and, secondly, we address the problems of interpolating or appro...
متن کاملForbidden Substrings, Kolmogorov Complexity and Almost Periodic Sequences
Assume that for some α < 1 and for all nutural n a set Fn of at most 2 “forbidden” binary strings of length n is fixed. Then there exists an infinite binary sequence ω that does not have (long) forbidden substrings. We prove this combinatorial statement by translating it into a statement about Kolmogorov complexity and compare this proof with a combinatorial one based on Laslo Lovasz local lemm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fractal and fractional
سال: 2023
ISSN: ['2504-3110']
DOI: https://doi.org/10.3390/fractalfract7050410